package binPack.shelf
{
	public class ShelfChoiceHeuristic
	{
		/**< -NF: We always put the new rectangle to the last open shelf.*/
		public static const ShelfNextFit:int = 0;
		/**< -FF: We test each rectangle against each shelf in turn and pack it to the first where it fits.*/
		public static const ShelfFirstFit:int = 1;
		/**< -BAF: Choose the shelf with smallest remaining shelf area.*/
		public static const ShelfBestAreaFit:int = 2;
		/**< -WAF: Choose the shelf with the largest remaining shelf area.*/
		public static const ShelfWorstAreaFit:int = 3;
		/**< -BHF: Choose the smallest shelf (height-wise) where the rectangle fits.*/
		public static const ShelfBestHeightFit:int = 4;
		/**< -BWF: Choose the shelf that has the least remaining horizontal shelf space available after packing.*/
		public static const ShelfBestWidthFit:int = 5;
		/**< -WWF: Choose the shelf that will have most remainining horizontal shelf space available after packing.*/
		public static const ShelfWorstWidthFit:int = 6;
	}
}